Security Trade-offs in Ancilla-Free Quantum Bit Commitment in the Presence of Superselection Rules
نویسندگان
چکیده
Security trade-offs have previously been established for one-way bit commitment. We study this trade-off in two superselection settings. We show that for an ‘abelian’ superselection rule (exemplified by particle conservation) the standard trade-off between sealing and binding properties still holds. For the non-abelian case (exemplified by angular momentum conservation) the security trade-off can be more subtle, which we illustrate by showing that if the bit commitment is forced to be ancilla-free, an asymptotically secure quantum bit commitment is possible. PACS: 03.670.-a, 03.67.Dd
منابع مشابه
Security Trade-offs in Ancilla-Free Quantum Bit Commitment in the Presence of Selection Rules
Security trade-offs have been established for one-way bit commitment in Ref. [1]. We study this trade-off in two selection settings. We show that for an ‘abelian’ selection rule (exemplified by particle conservation) the standard trade-off between sealing and binding properties still holds. For the nonabelian case (exemplified by angular momentum conservation) the security trade-off can be more...
متن کاملRemote preparation of arbitrary ensembles and quantum bit commitment
The Hughston-Jozsa-Wootters theorem shows that any finite ensemble of quantum states can be prepared “at a distance”, and it has been used to demonstrate the insecurity of all bit commitment protocols based on finite quantum systems without superselection rules. In this paper, we prove a generalized HJW theorem for arbitrary ensembles of states on a C-algebra. We then use this result to demonst...
متن کاملSuperselection rules and quantum protocols
We show that superselection rules do not enhance the information-theoretic security of quantum cryptographic protocols. Our analysis employs two quite different methods. The first method uses the concept of a reference system—in a world subject to a superselection rule, unrestricted operations can be simulated by parties who share access to a reference system with suitable properties. By this m...
متن کاملStronger impossibility results for quantum string commitment
String commitment schemes are similar to the well studied bit commitment schemes in cryptography with the difference that the committing party, say Alice is supposed to commit a long string instead of a single bit, to another party say Bob. Similar to bit commitment schemes, such schemes are supposed to be binding, i.e Alice cannot change her choice after committing and concealing i.e. Bob cann...
متن کاملImpossibility of quantum string commitment
String commitment schemes are similar to the well studied bit commitment schemes in cryptography with the difference that the committing party, say Alice is supposed to commit a long string instead of a single bit, to another party say Bob. Similar to bit commitment schemes, such schemes are supposed to be binding, i.e Alice cannot change her choice after committing and concealing i.e. Bob cann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004